University of Bamenda
Contact Staff & student login EN FR
UBa Cyber Crypto Centre
University of Bamenda
Apply
⌕ Search the centre
Master's PhD Bachelor's Certifications & training Funding & scholarships How to apply · FAQs
Apply
Contact · Login · UBa ↗ EN FR

Research publications

Publication by: FOUOTSA Emmanuel

Keyeword:

Co-authors: Oumar Diao

A Theta Model of Elliptic Curves In Mediterraneen Journal of Mathematics. Vol 14(2). Birkhauser (2017)

n/a

About the author

Other publications by the same author

Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography, In Codes, Cryptology, and Information Security. Vol 9084. pp 259-273, Springer, (2015)

n/a

Adequate Elliptic Curves for Computing the Product of n Pairings In Arithmetic of Finite Fields. Vol 10064. pp 36- 53 Springer, (2016)

n/a

Faster Ate Pairings Computation on Selmer model of elliptic Curves In Groups, complexity and Cryptology, Vol.8(1), pp 55-67, DeGruyter (2016)

n/a

A Theta Model of Elliptic Curves In Mediterraneen Journal of Mathematics. Vol 14(2). Birkhauser (2017)

n/a

Improving the Computation of Optimal Ate pairing at the Higher Security Level , In Journal of Applied Mathematics and Computing, Vol. 59, pp 21-36, Springer, (2018)

n/a

An Encoding to the Level Four Theta Model of Elliptic Curve , Innovations and Interdisciplinary Solutions for underserved Areas, LNICST Vol 249, pp 224-235, Springer (2018)

n/a

Parallelizing Ate Pairing on Hessian Elliptic Curve, In Arab Journal of Mathematics, Vol 25(1), pp 29-42, Elsevier, (2019)

n/a

Beta Weil Pairing Revisited, Afrika Matematika, Vol. 30 pp 371–388. Springer, (2019)

n/a

A New Attack on RSA and Demytko’s Elliptic Curve Cryptosystem, In Journal of Discrete Mathematical Science and Cryptography, Vol. 22(3) , pp 391-409, Taylors and Francis, (2019)

n/a

Complete Addition Formulas on Level Four Theta Model of Elliptic Curves. In Afrika Mathematika, \\DOI: 10.1007/s13370- 019-00736-6 Springer (2019)

n/a

Computing the Optimal Ate Pairing over Elliptic Curves with Embedding Degrees $54$ and $48$ at the $256$-bit security level, In International Journal of Applied Cryptography, DOI: 10.1504/IJACT.2020.10027563, Indersciences (2019)

n/a

Fast Hashing to $G_2$ on Aurifeuillean Pairing-Friendly Elliptic Curves. In SN Computer Sciences, Vol. 1(1), 51 DOI :10.1007/s42979-019-0053-5 Springer, (2019)

n/a

Division Polynomials on the Hessian Model of Elliptic Curves. In Applicable Algebra in Engineering, Communication and Computing, Springer (2020) Vol. 34, Pages 1-16, DOI : 10.1007/s00200-020-00470-8

n/a

Elliptic divisibility sequences over the Edwards model of elliptic curves, In Journal of Discrete Mathematical Science and Cryptography, Taylor and Francis (2021) Vol. 25 (8) : https ://doi.org/10.1080/09720529.2020.1822042.

n/a

:Isogenies on Twisted Hessian Curves; In Journal of Mathematical Cryptology, De Gruyter (2021) ; Vol 15 (1), pp. 345-358

n/a

: Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer; In Arabian Journal of Mathematics, Springer (2021) ; Vol. 10 (2), Pages 357-366, https ://doi.org/10.1007/s40065-021-00327- z.

n/a

Faster Beta Weil Pairing on BLS Pairing Friendly Curves with Odd Embedding Degree., In Mathematics in Computer Science. 16, 13. Springer Birkhäuser (2022). https ://doi.org/10.1007/s11786-022-00531-w

n/a

: New Versions of Miller-loop Secured against Side-Channel Attacks; In Arithmetic of Finite Field Springer (2022); Vol. 13638, pp 269-287; https://doi.org/10.1007/978-3-031-22944-2_17

n/a

: x-Superoptimal Pairings on some Elliptic Curves with Prime Odd Embedding Degrees; In Applicable Algebra in Engineering Communication and Computing, Springer (2023) https ://doi.org/10.1007/s00200-023-00596-5

n/a

: Faster optimal ate pairings for cyclotomic sparse families of pairing-friendly elliptic curves with embedding degrees 𝑘=5,7; In Discrete Mathematics, Algorithm and Applications. World Scientific (2023) https://doi.org/10.1142/S1793830923500544

n/a

: A Polynomial Algorithm for Solving the Closest Vector Problem in Tensored Root Lattices of Type D, In SN Computer Science Springer (2023), Vol 4(19) https://doi.org/10.1007/s42979-022-01440-2

n/a

: Sieve Algorithms for some orthogonal Lattices, In Discrete Mathematics, Algorithm and Applications. World Scientific (2023) https://doi.org/10.1142/S1793830922501518

n/a

: Expanded low-rank parity-check codes and their application to cryptography, In CRYPTOLOGIA, Taylor and Francis (2023) https://doi.org/10.1080/01611194.2023.2202960

n/a

: Low-Rank Parity-Check Codes Over Finite Commutative Rings, Accepted for publication in Applicable Algebra in Engineering, Communication and Computing, Springer, 2024

n/a